On the complexity of constructing minimum changeover cost arborescences
نویسندگان
چکیده
منابع مشابه
On the complexity of constructing minimum changeover cost arborescences
a r t i c l e i n f o a b s t r a c t The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. This cost depends only on the colors of the traversed edges. Reload costs arise in various applications such as transportation networks, energy distribution networks, and telecom...
متن کاملOn Minimum Changeover Cost Arborescences
We are given a digraph G = (N, A), where each arc is colored with one among k given colors. We look for a spanning arborescence T of G rooted at a given node and having minimum changeover cost. We call this the Minimum Changeover Cost Arborescence problem. To the authors’ knowledge, it is a new problem. The concept of changeover costs is similar to the one, already considered in the literature,...
متن کاملConstructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs
Given an edge-colored graph, a vertex on a path experiences a reload cost if it lies between two consecutive edges of different colors. The value of the reload cost depends only on the colors of the traversed edges. Reload cost has important applications in dynamic networks, such as transportation networks and dynamic spectrum access networks. In the minimum changeover cost arborescence (MinCCA...
متن کاملMinimum cost arborescences
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning tree games, where the costs are assumed to be symmetric. The focus is on rules which satisfy axioms re...
متن کاملOn the Complexity of Constructing Minimum Reload Cost Path-Trees
The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. The reload cost depends only on the colors of the traversed edges. Previous work on reload costs focuses on the problem of finding a spanning tree that minimizes the total reload cost from a source vertex to all othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.03.023